Multiple-Object Auctions with Budget Constrained Bidders
نویسندگان
چکیده
A seller with two objects faces a group of bidders who are subject to budget constraints. The objects have common values to all bidders, but need not be identical and may be either complements or substitutes. In a simple complete information setting we show: (1) if the objects are sold by means of a sequence of open ascending auctions, then it is always optimal to sell the more valuable object first; (2) the sequential auction yields more revenue than the simultaneous ascending auction used recently by the FCC if the discrepancy in the values is large, or if there are significant complementarities; (3) a hybrid simultaneous-sequential form is revenue superior to the sequential auction; and (4) budget constraints arise endogenously.
منابع مشابه
Sequential auctions for common value objects with budget constrained bidders
This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for objects but also have budget constraints (i.e., constraints on how much they can actually spend in an auction). Given these constraints, the bidders’ problem is to determine how much to bid in each auction. To this end, t...
متن کاملSimultaneous Ascending Bid Auctions
We analyze simultaneous ascending bid auctions with multiple objects in which bidders can be budget constrained. The presence of budget constraints shrinks the equilibrium set. A family of equilibria with a high degree of competition, as well as a family of equilibria with a high degree of collusion, disappear. When the budget available to each bidder is private information then even a very sma...
متن کاملAll-pay Auctions with Budget Constraints and Fair Insurance
We study all-pay auctions with budget-constrained bidders who have access to fair insurance before bidding simultaneously over a prize. We characterize a unique equilibrium for the special cases of two bidders and one prize, show existence and a heuristic for finding an equilibrium in the case of multiple bidders and multiple prizes. We end with an example of non-uniqueness of equilibria for th...
متن کاملStrong activity rules for iterative combinatorial auctions
Activity rules have emerged in recent years as an important aspect of practical auction design. The role of an activity rule in an iterative auction is to suppress strategic behavior by bidders and promote simple, continual, meaningful bidding and thus, price discovery. These rules find application in the design of iterative combinatorial auctions for real world scenarios, for example in spectr...
متن کاملKeyword Auctions with Budget-constrained Bidders
We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman, Ostrovsky, and Schwarz (2007) and Varian (2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price (GSP) auctions. However, bidders often have to set their daily budgets when they participate in an auction; on...
متن کامل